Constructing Permutation Rational Functions from Isogenies
نویسندگان
چکیده
منابع مشابه
Constructing Permutation Rational Functions From Isogenies
A permutation rational function f ∈ Fq(x) is a rational function that induces a bijection on Fq, that is, for all y ∈ Fq there exists exactly one x ∈ Fq such that f(x) = y. Permutation rational functions are intimately related to exceptional rational functions, and more generally exceptional covers of the projective line, of which they form the first important example. In this paper, we show ho...
متن کاملConstructing permutation arrays from groups
LetM(n, d) be the maximum size of a permutation array on n symbols with pairwise Hamming distance at least d. We use various combinatorial, algebraic, and computational methods to improve lower bounds forM(n, d). We compute the Hamming distances of affine semilinear groups and projective semilinear groups, and unions of cosets of AGL(1, q) and PGL(2, q) with Frobenius maps to obtain new, improv...
متن کاملOn the probability of having rational `-isogenies
We calculate the chance that an elliptic curve over a finite field has a specified number of `-isogenies which emanate from it. We give a partial answer for abelian varieties of arbitrary dimension. Mathematics Subject Classification (2000). 11G20; 14K02.
متن کاملConstructing transitive permutation groups
This paper presents a new algorithm to classify all transitive subgroups of the symmetric group up to conjugacy. It has been used to determine the transitive groups of degree up to 30.
متن کاملConstructing Isogenies between Elliptic Curves over Finite Fields
Let E1 and E2 be ordinary elliptic curves over a finite field Fp such that #E1(Fp) = #E2(Fp). Tate’s isogeny theorem states that there is an isogeny from E1 to E2 which is defined over Fp. The goal of this paper is to describe a probabilistic algorithm for constructing such an isogeny. The algorithm proposed in this paper has exponential complexity in the worst case. Nevertheless, it is efficie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2018
ISSN: 0895-4801,1095-7146
DOI: 10.1137/17m1135736